A dual iterative substructuring method with a penalty term in three dimensions
نویسندگان
چکیده
منابع مشابه
A dual iterative substructuring method with a penalty term
An iterative substructuring method with Lagrange multipliers is considered for the second order elliptic problem, which is a variant of the FETI-DP method. The standard FETI-DP formulation is associated with the saddle-point problem which is induced from the minimization problem with a constraint for imposing the continuity across the interface. Starting from the slightly changed saddle-point p...
متن کاملA Domain Decomposition Method Based on Augmented Lagrangian with a Penalty Term in Three Dimensions
In our earlier work [4], a dual iterative substructuring method for two dimensional problems was proposed, which is a variant of the FETI-DP method. The proposed method imposes continuity on the interface by not only the pointwise matching condition but also uses a penalty term which measures the jump across the interface. For a large penalization parameter, it was proven that the condition num...
متن کاملAn Iterative Substructuring Algorithm for Problems in Three Dimensions
In domain decomposition algorithms with more than a few subdomains, there is a crucial need for a mechanism to provide for global communication of information at each step of the iterative process. The convergence rate will decay rapidly with an increasing number of subdomains if communication is only between neighboring subdomains. For iterative substructuring algorithms (those domain decompos...
متن کاملAn iterative substructuring method for Maxwell's equations in two dimensions
Iterative substructuring methods, also known as Schur complement methods, form an important family of domain decomposition algorithms. They are preconditioned conjugate gradient methods where solvers on local subregions and a solver on a coarse mesh are used to construct the preconditioner. For conforming finite element approximations of H1, it is known that the number of conjugate gradient ste...
متن کاملAn Iterative Substructuring Method for Raviart-Thomas Vector Fields in Three Dimensions
The iterative substructuring methods, also known as Schur complement methods, form one of two important families of domain decomposition algorithms. They are based on a partitioning of a given region, on which the partial diierential equation is deened, into non-overlapping substructures. The preconditioners of these conjugate gradient methods are then deened in terms of local problems deened o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2012
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2012.04.011